Induced matchings in asteroidal triple-free graphs
نویسندگان
چکیده
منابع مشابه
Induced matchings in asteroidal triple-free graphs
An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of /nding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We /rst de/ne a wider class of graph...
متن کاملAsteroidal Triple-Free Graphs
An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common generalization of interval, permutation, trapezoid...
متن کاملLexBFS-Ordering in Asteroidal Triple-Free Graphs
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...
متن کاملIndependent Sets in Asteroidal Triple-Free Graphs
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of them avoiding the closed neighborhood of the third. A graph is called AT-free if it does not have an AT. We show that there is an O(n4) time algorithm to compute the maximum weight of an independent set for AT-free graphs. Furthermore, we obtain O(n4) time algorithms to solve the independent domin...
متن کاملVertex Ranking of Asteroidal Triple-Free Graphs
We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. lts running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00390-1